Montgomery Residue Representation Fault-Tolerant Computation in GF(2k)
نویسندگان
چکیده
In this paper, we are concerned with protecting elliptic curve computation in a tamper proof device by protecting finite field computation against active side channel attacks, i.e., fault attacks. We propose residue representation of the field elements for fault tolerant Montgomery residue representation multiplication algorithm, by providing fault models for fault attacks, and countermeasures to some fault inducing attacks.
منابع مشابه
Parallel Montgomery Multiplication in GF (2) using Trinomial Residue Arithmetic
We propose the first general multiplication algorithm in GF (2k) with a subquadratic area complexity of O(k8/5) = O(k1.6). We represent the elements of GF (2k) according to 2n pairwise prime trinomials, T1, . . . , T2n, of degree d, such that nd ≥ k. Our algorithm is based on Montgomery’s multiplication applied to the ring formed by the direct product of the n first trinomials.
متن کاملNonbinary quantum codes
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional global symmetries. From this standpoint, the analogues of Calderbank-Shor-Steane codes and of GF(4)-linear codes turn out to be special cases of the same const...
متن کاملFault Tolerant Computation of Large Inner Products Fault Tolerant Computation of Large Inner Products
In this paper we introduce a new technique for applying fault tolerance to Modulus Replication RNS computations by adding redundancy to the independent computational channels. This technique provides a low-overhead solution to fault tolerant large inner product computations.
متن کاملOn Montgomery-Like Representationsfor Elliptic Curves over GF(2k)
This paper discusses representations for computation on non-supersingular elliptic curves over binary fields, where computations are performed on the x-coordinates only. We discuss existing methods and present a new one, giving rise to a faster addition routine than previous Montgomery-representations. As a result a double exponentiation routine is described that requires 8.5 field multiplicati...
متن کاملFault-Tolerant Finite Field Computation in the Public Key Cryptosystems
In this paper, we propose a new method for fault tolerant computation over GF (2) for use in public key cryptosystems. In particular, we are concerned with the active side channel attacks, i.e., fault attacks. We define a larger ring in which new computation is performed with encoded elements while arithmetic structure is preserved. Computation is decomposed into parallel, mutually independent,...
متن کامل